Improved artificial bee colony algorithm for vehicle routing problem with time windows
نویسندگان
چکیده
This paper investigates a well-known complex combinatorial problem known as the vehicle routing problem with time windows (VRPTW). Unlike the standard vehicle routing problem, each customer in the VRPTW is served within a given time constraint. This paper solves the VRPTW using an improved artificial bee colony (IABC) algorithm. The performance of this algorithm is improved by a local optimization based on a crossover operation and a scanning strategy. Finally, the effectiveness of the IABC is evaluated on some well-known benchmarks. The results demonstrate the power of IABC algorithm in solving the VRPTW.
منابع مشابه
Multi-Objective Vehicle Routing Problems with Time Windows: A Vector Evaluated Artificial Bee Colony Approach
The vehicle routing problem with time windows, widely used in practice, is an NP-hard problem. This paper presents a new meta-heuristic algorithm for solving the problem. Unlike traditional two-steps algorithms, the proposed optimization algorithm, based on the artificial bee colony algorithm combined with the vector evaluated technique, solves the problem as a multi-objective problem. As a res...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملAn Improved Hybrid Cuckoo Search Algorithm for Vehicle Routing Problem with Time Windows
Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...
متن کاملA PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows
Transportation sector generates a considerable part of each nation's gross domestic product and considered among the largest consumers of oil products in the world. This paper proposes a heuristic method for the vehicle routing problem with hard time windows while incorporating the costs of fuel, driver, and vehicle. The proposed heuristic uses a novel speed optimization algorithm to reach its ...
متن کاملSolving the Vehicle Routing Problem with Time Windows by Bee Colony Optimization Metaheuristic
The vehicle routing problem with time windows is studied in the paper. This problem has been solved by Bee Colony Optimization metaheuristic. Proposed algorithm has been tested on the set of well-known benchmark examples. Obtained results show that the presented algorithm can find high-quality solutions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 12 شماره
صفحات -
تاریخ انتشار 2017